By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 30, Issue 3, pp. 689-1040

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies Are Not Robust

Wai-Kau Lo and Vassos Hadzilacos

pp. 689-728

BibTeX  Abstract Full Text:  PDF

From Gene Trees to Species Trees

Bin Ma, Ming Li, and Louxin Zhang

pp. 729-752

BibTeX  Abstract Full Text:  PDF

The General Structure of Edge-Connectivity of a Vertex Subset in a Graph and its Incremental Maintenance. Odd Case

Yefim Dinitz and Alek Vainshtein

pp. 753-808

BibTeX  Abstract Full Text:  PDF

Formal-Language-Constrained Path Problems

Chris Barrett, Riko Jacob, and Madhav Marathe

pp. 809-837

BibTeX  Abstract Full Text:  PDF

A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs

Xin He, Ming-Yang Kao, and Hsueh-I Lu

pp. 838-846

BibTeX  Abstract Full Text:  PDF

Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles

Sanjiv Kapoor and S. N. Maheshwari

pp. 847-871

BibTeX  Abstract Full Text:  PDF

Optimal Worst Case Formulas Comparing Cache Memory Associativity

Hakan Lennerstad and Lars Lundberg

pp. 872-905

BibTeX  Abstract Full Text:  PDF

Markov Paging

Anna R. Karlin, Steven J. Phillips, and Prabhakar Raghavan

pp. 906-922

BibTeX  Abstract Full Text:  PDF

Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel--Ziv Scheme

Charles Knessl and Wojciech Szpankowski

pp. 923-964

BibTeX  Abstract Full Text:  PDF

Simple Confluently Persistent Catenable Lists

Haim Kaplan, Chris Okasaki, and Robert E. Tarjan

pp. 965-977

BibTeX  Abstract Full Text:  PDF

Approximating the Stretch Factor of Euclidean Graphs

Giri Narasimhan and Michiel Smid

pp. 978-989

BibTeX  Abstract Full Text:  PDF

The Formula Isomorphism Problem

Manindra Agrawal and Thomas Thierauf

pp. 990-1009

BibTeX  Abstract Full Text:  PDF

The Computational Complexity to Evaluate Representations of General Linear Groups

Peter Bürgisser

pp. 1010-1022

BibTeX  Abstract Full Text:  PDF

The Computational Complexity of Immanants

Peter Bürgisser

pp. 1023-1040

BibTeX  Abstract Full Text:  PDF